//
// Created by sjjmw on 1/21/2022.
//

#include "base.h"

class Solution {
public:
    int uniquePaths(int m, int n) {
        vector<vector<int>> dp;
        dp.resize(m);
        for(int i=0;i<dp.size();i++){
            dp[i].resize(n);
        }
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                if(i!=0&&j!=0){
                    dp[i][j]+=dp[i-1][j];
                    dp[i][j]+=dp[i][j-1];
                }else{
                    dp[i][j]=1;
                }
            }
        }
        return dp[m-1][n-1];
    }
};